Remarks on Computing Irreducible Characters

نویسنده

  • G. LUSZTIG
چکیده

0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq-rational points of G. We would like to present here a strategy for computing the character table of G(Fq) , under the assumption that p, the characteristic of Fq , is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general case, we can find a connected reductive group G with simply connected derived group, and a surjective homomorphism I: G G whose kernel is a central torus such that G and I are defined ov:.r Fq ; then the character table

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the irreducible characters of Camina triples

The Camina triple condition is a generalization of the Camina condition in the theory of finite groups. The irreducible characters of Camina triples have been verified in the some special cases. In this paper, we consider a Camina triple (G,M,N)  and determine the irreducible characters of G in terms of the irreducible characters of M and G/N.  

متن کامل

Irreducible characters of Sylow $p$-subgroups of the Steinberg triality groups ${}^3D_4(p^{3m})$

‎‎Here we construct and count all ordinary irreducible characters of Sylow $p$-subgroups of the Steinberg triality groups ${}^3D_4(p^{3m})$.

متن کامل

Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups

‎Let $G$ be a finite group‎. ‎We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$‎. ‎In this paper we characterize solvable groups $G$ in which the derived covering number is finite‎.‎ 

متن کامل

On the Computation of Group Characters

Computational methods for finding the character table of a finite group require a stock of reducible characters and techniques for decomposing these characters into irreducible characters. A method for generating reducible characters from a representation of a group is proposed. Several new techniques for computing the irreducible decompositions of a set of characters are given; these technique...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009